Ramsey-Paris-Harrington numbers for graphs
نویسندگان
چکیده
منابع مشابه
Some Bounds for the Ramsey-Paris-Harrington Numbers
It has recently been discovered that a certain variant of Ramsey's theorem cannot be proved in first-order Peano arithmetic although it is in fact a true theorem. In this paper we give some bounds for the "Ramsey-Paris-Harrington numbers" associated with this variant of Ramsey's theorem, involving coloring of pairs . In the course of the investigation we also study certain weaker and stronger p...
متن کاملSharp Phase Transition Thresholds for the Paris Harrington Ramsey Numbers for a Fixed Dimension
This article is concerned with investigations on a phase transition which is related to the (finite) Ramsey theorem and the Paris-Harrington theorem. For a given number-theoretic function g, let Rd c (g)(k) be the least natural number R such that for all colourings P of the d-element subsets of {0, . . . , R− 1} with at most c colours there exists a subset H of {0, . . . , R− 1} such that P has...
متن کاملThe Paris-Harrington Theorem
In Ramsey theory, very large numbers and fast-growing functions are more of a rule than an exception. The classical Ramsey numbers R(n,m) are known to be of exponential size: the original proof directly gives the upper bound R(n,m) ≤ ( m+n−2 n−1 ) , and an exponential lower bound is also known. For the van der Waerden numbers, the original proof produced upper bounds that were not even primitiv...
متن کاملRamsey numbers of degenerate graphs
A graph is d-degenerate if all its subgraphs have a vertex of degree at most d. We prove that there exists a constant c such that for all natural numbers d and r, every d-degenerate graph G of chromatic number r has Ramsey number at most 2 cr |V (G)|. This solves a conjecture of Burr and Erdős from 1973.
متن کاملConstrained Ramsey numbers of graphs
Given two graphs G and H, let f (G,H) denote the minimum integer n such that in every coloring of the edges of Kn, there is either a copy of G with all edges having the same color or a copy of H with all edges having different colors. We show that f (G,H) is finite iff G is a star or H is acyclic. If S and T are trees with s and t edges, respectively, we show that 1þ s (t 2)/2 f (S,T ) (s 1)(t ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1985
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90018-4